Separating the eraser Turing machine classes I + , NIL , , co - N ! + _ and P , Matthias Krause
نویسندگان
چکیده
Krause, M., C. Meinel and S. Waack, Separating the eraser Turing machine classes, Theoretical Computer Science 86 (1991) 267-275. By means of exponential lower and polynomial upper bounds for read-once-only n-branching programs we separate the logarithmic space-bounded complexity classes L,, NL,, co-NL, and P, for eraser Turing machines.
منابع مشابه
Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing Machines
In thefollowing we prove that input oblivious simultaneously linear access-time and logarithmic space-bounded nondeterministic Turing machines are more powerful than deterministic ones. Moreover, we separate all the corresponding complexity classes Lo Hn, 7VZ0Un, co-NL0i Iîn and P~AL01infrom each other. Résumé. — Dans cet article, nous prouvons que les machines de Turing non déterministes à lec...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملRelativized Counting Classes: Relations among Thresholds, Parity, and Mods
Well known complexity classes such as NP, co-NP, P (PARITY-P), and PP are produced by considering a nondeterministic polynomial time Turing machine N and deening acceptance in terms of the number of accepting paths in N. That is, they are subclasses of P #PP1]. Other interesting classes such as MOD k P and C = P are also subclasses of P #PP1]. Many relations among these classes are unresolved. ...
متن کاملSeparating NOF communication complexity classes RP and NP
In the number-on-forehead (NOF) model of communication complexity, k players are trying to evaluate a function F defined on kn bits. The input of F is partitioned into k pieces of n bits each, call them x1, . . . ,xk, and xi is placed, metaphorically, on the forehead of player i. Thus, each player sees (k − 1)n of the kn input bits. The players communicate by writing bits on a shared blackboard...
متن کاملSeparating the Classes of Recursively Enumerable Languages Based on Machine Size
Many years ago it was observed that the r.e. languages form an infinite proper hierarchy RE1 ⊂ RE2 ⊂ · · · based on the size of the Turing machines that accept them. Aside from some basic facts, little seems known about it in general. We examine the position of the finite languages and their complements in the hierarchy. We show that for every finite language L one has L, L̄ ∈ REn for some n ≤ p...
متن کامل